0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n013.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 13:02:03 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.37	% Number of cores: 8
0.15/0.37	% Python version: Python 3.6.8
0.15/0.37	# Version: 2.6rc1-ho
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 59 seconds
0.22/0.43	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
0.22/0.43	# and selection function SelectCQIPrecWNTNp.
0.22/0.43	#
0.22/0.43	# Preprocessing time       : 0.049 s
0.22/0.43	# Presaturation interreduction done
0.22/0.43	
0.22/0.43	# Proof found!
0.22/0.43	# SZS status Theorem
0.22/0.43	# SZS output start CNFRefutation
0.22/0.43	thf(fact_2__092_060open_062_092_060lbrakk_062is__heap_A_Iheapify_Al_J_059_Ais__heap_A_Iheapify_Ar_J_059_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_A_061_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_IT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_J_J_092_060close_062, axiom, ((is_heap_a @ (heapIm970322378pify_a @ r)=>((t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))=(t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))=>is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r)))))<=is_heap_a @ (heapIm970322378pify_a @ l)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_2__092_060open_062_092_060lbrakk_062is__heap_A_Iheapify_Al_J_059_Ais__heap_A_Iheapify_Ar_J_059_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_A_061_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_IT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_J_J_092_060close_062)).
0.22/0.43	thf(fact_1_T_Ohyps_I1_J, axiom, is_heap_a @ (heapIm970322378pify_a @ l), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_T_Ohyps_I1_J)).
0.22/0.43	thf(fact_0_T_Ohyps_I2_J, axiom, is_heap_a @ (heapIm970322378pify_a @ r), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_T_Ohyps_I2_J)).
0.22/0.43	thf(fact_3_heapify_Osimps_I2_J, axiom, ![X1:a, X65:tree_a, X130:tree_a]:(heapIm970322378pify_a @ (t_a @ X1 @ X65 @ X130))=(heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm970322378pify_a @ X65) @ (heapIm970322378pify_a @ X130))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3_heapify_Osimps_I2_J)).
0.22/0.43	thf(conj_0, conjecture, is_heap_a @ (heapIm970322378pify_a @ (t_a @ v @ l @ r)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.22/0.43	thf(c_0_5, plain, (is_heap_a @ (heapIm970322378pify_a @ l)=>(is_heap_a @ (heapIm970322378pify_a @ r)=>((t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))=(t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))=>is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r)))))), inference(fof_simplification,[status(thm)],[fact_2__092_060open_062_092_060lbrakk_062is__heap_A_Iheapify_Al_J_059_Ais__heap_A_Iheapify_Ar_J_059_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_A_061_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_IT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_J_J_092_060close_062])).
0.22/0.43	thf(c_0_6, plain, (~is_heap_a @ (heapIm970322378pify_a @ l)|(~is_heap_a @ (heapIm970322378pify_a @ r)|((t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))!=(t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))|is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r)))))), inference(fof_nnf,[status(thm)],[c_0_5])).
0.22/0.43	thf(c_0_7, plain, (is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r)))|~is_heap_a @ (heapIm970322378pify_a @ l)|~is_heap_a @ (heapIm970322378pify_a @ r)|(t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))!=(t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.22/0.43	thf(c_0_8, plain, (is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r)))|~is_heap_a @ (heapIm970322378pify_a @ l)|~is_heap_a @ (heapIm970322378pify_a @ r)), inference(cn,[status(thm)],[c_0_7])).
0.22/0.43	thf(c_0_9, plain, is_heap_a @ (heapIm970322378pify_a @ l), inference(split_conjunct,[status(thm)],[fact_1_T_Ohyps_I1_J])).
0.22/0.43	thf(c_0_10, plain, is_heap_a @ (heapIm970322378pify_a @ r), inference(split_conjunct,[status(thm)],[fact_0_T_Ohyps_I2_J])).
0.22/0.43	thf(c_0_11, plain, ![X1009:a, X1010:tree_a, X1011:tree_a]:(heapIm970322378pify_a @ (t_a @ X1009 @ X1010 @ X1011))=(heapIm1091024090Down_a @ (t_a @ X1009 @ (heapIm970322378pify_a @ X1010) @ (heapIm970322378pify_a @ X1011))), inference(variable_rename,[status(thm)],[fact_3_heapify_Osimps_I2_J])).
0.22/0.43	thf(c_0_12, negated_conjecture, ~is_heap_a @ (heapIm970322378pify_a @ (t_a @ v @ l @ r)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.22/0.43	thf(c_0_13, plain, is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v @ (heapIm970322378pify_a @ l) @ (heapIm970322378pify_a @ r))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
0.22/0.43	thf(c_0_14, plain, ![X1:a, X3:tree_a, X4:tree_a]:(heapIm970322378pify_a @ (t_a @ X1 @ X3 @ X4))=(heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm970322378pify_a @ X3) @ (heapIm970322378pify_a @ X4))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.22/0.43	thf(c_0_15, negated_conjecture, ~is_heap_a @ (heapIm970322378pify_a @ (t_a @ v @ l @ r)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.22/0.43	thf(c_0_16, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_15]), ['proof']).
0.22/0.43	# SZS output end CNFRefutation
0.22/0.43	# Proof object total steps             : 17
0.22/0.43	# Proof object clause steps            : 8
0.22/0.43	# Proof object formula steps           : 9
0.22/0.43	# Proof object conjectures             : 3
0.22/0.43	# Proof object clause conjectures      : 1
0.22/0.43	# Proof object formula conjectures     : 2
0.22/0.43	# Proof object initial clauses used    : 5
0.22/0.43	# Proof object initial formulas used   : 5
0.22/0.43	# Proof object generating inferences   : 0
0.22/0.43	# Proof object simplifying inferences  : 6
0.22/0.43	# Training examples: 0 positive, 0 negative
0.22/0.43	# Parsed axioms                        : 192
0.22/0.43	# Removed by relevancy pruning/SinE    : 0
0.22/0.43	# Initial clauses                      : 376
0.22/0.43	# Removed in clause preprocessing      : 62
0.22/0.43	# Initial clauses in saturation        : 314
0.22/0.43	# Processed clauses                    : 102
0.22/0.43	# ...of these trivial                  : 1
0.22/0.43	# ...subsumed                          : 18
0.22/0.43	# ...remaining for further processing  : 83
0.22/0.43	# Other redundant clauses eliminated   : 17
0.22/0.43	# Clauses deleted for lack of memory   : 0
0.22/0.43	# Backward-subsumed                    : 1
0.22/0.43	# Backward-rewritten                   : 1
0.22/0.43	# Generated clauses                    : 13
0.22/0.43	# ...of the previous two non-trivial   : 2
0.22/0.43	# Contextual simplify-reflections      : 0
0.22/0.43	# Paramodulations                      : 0
0.22/0.43	# Factorizations                       : 0
0.22/0.43	# NegExts                              : 0
0.22/0.43	# Equation resolutions                 : 17
0.22/0.43	# Propositional unsat checks           : 0
0.22/0.43	#    Propositional check models        : 0
0.22/0.43	#    Propositional check unsatisfiable : 0
0.22/0.43	#    Propositional clauses             : 0
0.22/0.43	#    Propositional clauses after purity: 0
0.22/0.43	#    Propositional unsat core size     : 0
0.22/0.43	#    Propositional preprocessing time  : 0.000
0.22/0.43	#    Propositional encoding time       : 0.000
0.22/0.43	#    Propositional solver time         : 0.000
0.22/0.43	#    Success case prop preproc time    : 0.000
0.22/0.43	#    Success case prop encoding time   : 0.000
0.22/0.43	#    Success case prop solver time     : 0.000
0.22/0.43	# Current number of processed clauses  : 68
0.22/0.43	#    Positive orientable unit clauses  : 25
0.22/0.43	#    Positive unorientable unit clauses: 1
0.22/0.43	#    Negative unit clauses             : 6
0.22/0.43	#    Non-unit-clauses                  : 36
0.22/0.43	# Current number of unprocessed clauses: 214
0.22/0.43	# ...number of literals in the above   : 715
0.22/0.43	# Current number of archived formulas  : 0
0.22/0.43	# Current number of archived clauses   : 2
0.22/0.43	# Clause-clause subsumption calls (NU) : 143
0.22/0.43	# Rec. Clause-clause subsumption calls : 130
0.22/0.43	# Non-unit clause-clause subsumptions  : 19
0.22/0.43	# Unit Clause-clause subsumption calls : 6
0.22/0.43	# Rewrite failures with RHS unbound    : 0
0.22/0.43	# BW rewrite match attempts            : 14
0.22/0.43	# BW rewrite match successes           : 9
0.22/0.43	# Condensation attempts                : 0
0.22/0.43	# Condensation successes               : 0
0.22/0.43	# Termbank termtop insertions          : 23913
0.22/0.43	
0.22/0.43	# -------------------------------------------------
0.22/0.43	# User time                : 0.054 s
0.22/0.43	# System time              : 0.007 s
0.22/0.43	# Total time               : 0.061 s
0.22/0.43	# Maximum resident set size: 1988 pages
0.22/0.43	EOF